Since PDQ priority uses more threads to process a query than the normal way, it will shorten data access time. 因为PDQ优先级使用比常规方法更多的线程来处理一个查询,所以它将缩短数据访问时间。
Thus those who give priority to search and query large documents word similarity, and to be able to retrieve documents according to similarity with the query words to sort. 从而优先检索那些和查询词相似度大的文档,并且能够对检索出的文档按照与查询词的相似度进行排序。
Combined with a priority queue, the closest point query algorithm can be generalized to search multi-nearest-neighbors ordered by their distances to a query point. 结合优先级队列,基于有界k-d树的最近点查询算法可拓展到搜索按距离远近排列的多个最近点。